Unique expansion matroids and union minimal matroids

نویسندگان

  • Hua Yao
  • William Zhu
چکیده

The expansion axiom of matroids requires only the existence of some kind of independent sets, not the uniqueness of them. This causes that the base families of some matroids can be reduced while the unions of the base families of these matroids remain unchanged. In this paper, we define unique expansion matroids in which the expansion axiom has some extent uniqueness; we define union minimal matroids in which the base families have some extent minimality. Some properties of them and the relationship between them are studied. First, we propose the concepts of secondary base and forming base family. Secondly, we propose the concept of unique expansion matroid, and prove that a matroid is a unique expansion matroid if and only if its forming base family is a partition. Thirdly, we propose the concept of union minimal matroid, and prove that unique expansion matroids are union minimal matroids. Finally, we extend the concept of unique expansion matroid to unique exchange matroid and prove that both unique expansion matroids and their dual matroids are unique exchange matroids.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CATEGORICAL RELATIONS AMONG MATROIDS, FUZZY MATROIDS AND FUZZIFYING MATROIDS

The aim of this paper is to study the categorical relations betweenmatroids, Goetschel-Voxman’s fuzzy matroids and Shi’s fuzzifying matroids.It is shown that the category of fuzzifying matroids is isomorphic to that ofclosed fuzzy matroids and the latter is concretely coreflective in the categoryof fuzzy matroids. The category of matroids can be embedded in that offuzzifying matroids as a simul...

متن کامل

Matroid union - Graphic? Binary? Neither?

Graphic matroids form one of the most significant classes in matroid theory. When introducing matroids, Whitney concentrated on relations to graphs. The definition of some basic operations like deletion, contraction and direct sum were straightforward generalizations of the respective concepts in graph theory. Most matroid classes, for example those of binary, regular or graphic matroids, are c...

متن کامل

Structural properties of fuzzy graphs

Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study  connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids  from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...

متن کامل

On the Excluded Minors for the Matroids That Are Either Binary or Ternary

The classes of binary and ternary matroids are both relatively well understood as is their intersection, the class of regular matroids. This paper considers the union M of the classes of binary and ternary matroids. M is a minor-closed class and the focus of the paper is on determining its set of excluded minors. It is conjectured here that this set of excluded minors unique matroids that are o...

متن کامل

On the decomposition of ternary matroids

Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of dependence. Matroids generalize linear dependence over vector spaces, and they also abstract the properties of graphs, in the former case they are called Vector Matroids, in the latter they are called Graphic Matroids [3]. The operation of Matroid Union was introduced by Nash-Williams in 1966. A matroid is i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1307.2708  شماره 

صفحات  -

تاریخ انتشار 2013